package com.SuanFa.mati;

import java.util.Scanner;

public class bbb {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int max = 1;
        int [] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = sc.nextInt();
        }
        for (int i = 0; i < nums.length; i++) {
            int max1 = 1;
            int temp =i;
            int temp1 = i;
            for (int j = 1; j < nums.length; j++) {
                if(i-j>=0&&nums[temp]>=nums[i-j]){
                    max1++;
                }else {
                    break;
                }
                temp=i-j;
            }
            for (int j = 1; j < nums.length; j++) {
                if (i+j<nums.length&&nums[temp1]>=nums[i+j]){
                    max1++;
                }else {
                    break;
                }
                temp1=i+j;
            }
            max = Math.max(max1,max);
        }
        System.out.println(max);
    }
}
